#pragma comment(linker, "/STACK:16777216")

#include <algorithm>
#include <iostream>
#include <string>
#include <sstream>
#include <string.h>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <ctime>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef unsigned long long ull;

#define FOR(i,a,b) for (int i(a); i < (b); i++) 
#define REP(i,n) FOR(i,0,n) 
#define SORT(v) sort((v).begin(),(v).end())
#define UN(v) sort((v).begin(),(v).end()),v.erase(unique(v.begin(),v.end()),v.end())
#define CL(a,b) memset(a,b,sizeof(a))
#define pb push_back


int n, m, k, a, b, c, i, j, p[3000];
short t[3000][3000][3000];
vi adj[3000];

void read(){
	scanf("%d%d%d", n, m, k);
	REP(i,m){
		scanf("%d%d", a, b);
		--a;--b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	REP(i,k){
		scanf("%d%d%d", a, b, c);
		--a;--b;--c;
		t[a][b][c]=1;
	}
}
void process(){
	queue<int> q;
	
	q.push(0);
	
	while(!q.empty()){
		q.pop();
	}
}

int main(){ 
#ifdef LocalHost
	
	freopen("out.txt","w",stdout);
#endif
	freopen("in.txt","r",stdin);
	read();
	process();
#ifdef LocalHost
	cout<<endl<<endl<<"TIME: "<<clock()<<endl;
#endif
	return 0;
}
